Anonymous Broadcast Messages

نویسندگان

  • Dragan Lazic
  • Charlie Obimbo
چکیده

The Dining Cryptographer network (or DC-net) is a privacy preserving communication protocol devised by David Chaum for anonymous message publication. A very attractive feature of DC-nets is the strength of its security, which is inherent in the protocol and is not dependent on other schemes, like encryption. Unfortunately the DC-net protocol has a level of complexity that causes it to suffer from exceptional communication overhead and implementation difficulty that precludes its use in many real-world use-cases. We have designed and created a DC-net implementation that uses a pure clientserver model, which successfully avoids much of the complexity inherent in the DC-net protocol. We describe the theory of DCnets and our pure client-server implementation, as well as the compromises that were made to reduce the protocol’s level of complexity. Discussion centers around the details of our implementation of DC-net. Keywords—Dining Cryptographer network; Privacy; senderuntraceability

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Implementation of an Auction Protocol over Anonymous Networks

ions used Abstract networks and concrete implementations The main aim of building the anonymous communication protocols was to be able to experiment on them while they were able to function over real life networks. For this reason an abstract notion of a network was defined on which the anonymous communication protocols would function. The “abstract network” should be able to send messages to a...

متن کامل

Reliable broadcast in anonymous distributed systems with fair lossy channels

Reliable Broadcast is used to disseminate messages among a set of processes with RB broadcast() and RB deliver() operations, which was introduced in [1]. Reliable Broadcast is a broadcast service that requires all non-crashed processes deliver the same set of messages. This service has been extensively studied in non-anonymous systems, usually assuming that communication channels are reliable (...

متن کامل

Secure Anonymous Broadcast

In anonymous broadcast, one or more parties want to anonymously send messages to all parties. This problem is increasingly important as a black-box in many privacy-preserving applications such as anonymous communication, distributed auctions, and multi-party computation. In this paper, we design decentralized protocols for anonymous broadcast that require each party to send (and compute) a poly...

متن کامل

Privacy-preserving multireceiver ID-based encryption with provable security

Multireceiver identity (ID) based encryption and ID-based broadcast encryption allow a sender to use the public identities of multiple receivers to encrypt messages so that only the selected receivers or a privileged set of users can decrypt the messages. It can be used for many practical applications such as digital content distribution, pay-per-view and multicast communication. For protecting...

متن کامل

ATCS: A Novel Anonymous and Traceable Communication Scheme for Vehicular Ad Hoc Networks

Generally vehicles in VANETs should periodically broadcast safety messages. Since safety messages contain traffic related information and are sensitive to location privacy, it is essential to ensure anonymity, authenticity and traceability in broadcast. These conflicting requirements make it difficult to design a secure communication scheme for VANETs. In this paper, we propose a signature sche...

متن کامل

An Indistinguishability-Based Characterization of Anonymous Channels

We revisit the problem of anonymous communication, in which users wish to send messages to each other without revealing their identities. We propose a novel framework to organize and compare anonymity definitions. In this framework, we present simple and practical definitions for anonymous channels in the context of computational indistinguishability. The notions seem to capture the intuitive p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013